Smart - Suspend-and-Resume for Rarity Scheduling
نویسندگان
چکیده
It is common nowadays to architect and design scaled-out systems with off-the-shelf computing components operated and managed by off-the-shelf open-source tools. While web services represent the critical set of services offered at scale, big data analytics is emerging as a preferred service to be colocated with cloud web services at a lower priority raising the need for off-the-shelf priority scheduling. In this paper we report on the perils of Linux priority scheduling tools when used to differentiate between such complex services. We demonstrate that simple priority scheduling utilities such as nice and ionice can result in dramatically erratic behavior. We provide a remedy by proposing an autonomic priority scheduling algorithm that adjusts its execution parameters based on on-line measurements of the current resource usage of critical applications. Detailed experimentation with a user-space prototype of the algorithm on a Linux system using popular benchmarks such as SPEC and TPC-W illustrate the robustness and versatility of the proposed technique, as it provides consistency to the expected performance of a high-priority application when running simultaneously with multiple low priority jobs.
منابع مشابه
Exceptional Control Flow II
System Runs Many Processes Concurrently Process: executing program State consists of memory image + register values + program counter Continually switches from one process to another Suspend process when it needs I/O resource or timer event occurs Resume process when I/O available or given scheduling priority Appears to user(s) as if all processes executing simultaneously Even though most syste...
متن کاملEnabling Internet Suspend/Resume with Session Continuations
Mobile laptop users have grown accustomed to the “suspend/resume” model of computing, in which activity can be resumed precisely from the point at which it was suspended, despite arbitrary periods of inactivity. Unfortunately, today’s Internet hosts lack support for seamless operation of session-based network applications across periods of disconnectivity; hence, contemporary operating systems ...
متن کاملBetter approximation guarantees for job - shop scheduiing
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein & Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work, and preseut further improvements for some important NP-hard special cases of this problem (e.g.' in the preempliue case where machines...
متن کاملA resource management framework for reflective multimedia middleware
ion getLL() Get the lower-level abstraction of this entity. Void setLL(In Abstraction abst) Set the lower-level abstraction of this entity. Abstraction getHL() Get the higher-level abstraction of this entity. Void setHL(In abstraction abst) Set the higher-level abstraction of this entity. Operations on Factoriesion getHL() Get the higher-level abstraction of this entity. Void setHL(In abstracti...
متن کاملAlgorithms and Systems for Virtual Machine Scheduling in Cloud Infrastructures
With the emergence of cloud computing, computing resources (i.e., networks, servers, storage, applications, etc.) are provisioned as metered on-demand services over networks, and can be rapidly allocated and released with minimal management effort. In the cloud computing paradigm, the virtual machine (VM) is one of the most commonly used resource units in which business services are encapsulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013